MAMCRA: a constrained-based multicast routing algorithm

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

MAMCRA: a constrained-based multicast routing algorithm

Multicast routing algorithms that are capable of providing quality of service (QoS) to its members will play an important role in future communications networks. This paper discusses some fundamental properties of multicast routing subject to multiple QoS requirements. We will show that guaranteeing QoS and optimizing resource utilization are conflicting objectives and require a trade-off. We a...

متن کامل

Delay-Constrained Multicast Routing Algorithm Based on Average Distance Heuristic

Multicast is the ability of a communication network to accept a single message from an application and to deliver copies of the message to multiple recipients at different location. With the development of Internet, Multicast is widely applied in all kinds of multimedia real-time application: distributed multimedia systems, collaborative computing, video-conferencing, distance education, etc. I...

متن کامل

A Distributed Delay-Constrained Dynamic Multicast Routing Algorithm

Many new distributed multimedia applications involve dynamic multiple participants, have stringent end-to-end delay requirement and consume large amount of network resources. In this paper, we propose a distributed delay-constrained dynamic multicast routing algorithm (DCDMR) to support these applications. DCDMR scales well because the source of the multicast tree needs only limited computation...

متن کامل

Multicast Routing Algorithm Based On Genetic Algorithm

MRAGA (Multicast Routing Algorithm based on Genetic algorithm) for the DelayConstrained Minimum-Energy Multicast Routing problem was presented. The genetic operators of this algorithm reduce the transmission delay and energy consumption of multicast trees, thus accelerating the convergence speed of the algorithm. Experiment results show that the multicast tree found by this algorithm not only g...

متن کامل

Polynomial Algorithm for Bandwidth-Delay-Constrained Multicast Routing Problem

Most network-based multimedia applications require multicasting with constraints such as bandwidth and delay in order to support group communication and their quality of services (QoS). This can be considered as the problem of constructing a multicast tree with delay and bandwidth constraints over a given network topology. This paper proposes a novel algorithm to solve this problem with a small...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computer Communications

سال: 2002

ISSN: 0140-3664

DOI: 10.1016/s0140-3664(01)00402-9